package algorithm.leetcode;

/**
 * @author wuwen
 * @since 2023/12/7
 */
public class NO5_最长回文子串 {

    public static void main(String[] args) {
        // todo
    }

    static class Solution {
        public String longestPalindrome(String s) {
            int n = s.length();
            return null;
        }
    }

}

